Improving PageRank using sports results modeling
نویسندگان
چکیده
How to rank participants of a sports tournament is fundamental importance. While PageRank has been extensively used for this task, the algorithm’s superiority over simpler ranking methods never clearly demonstrated. We address knowledge gap by comparing performance multiple on synthetic datasets where true known and methods’ can be thus quantified standard information filtering metrics. Using results from 18 major leagues, we calibrate state-of-art model, variation classical Bradley–Terry results. identify relevant range parameters under which model reproduces statistical patterns found in analyzed empirical datasets. Our evaluation shows that outperforms benchmark number wins only early when small fraction all games have played yet. Increased randomness data due home team advantage, example, further reduces PageRank’s superiority. propose new variant combines forward backward propagation directed network representing input The method evaluated settings and, sufficiently sport not too random, it also wins. Beyond presented comparison methods, our work paves way designing optimal algorithms data.
منابع مشابه
Improving PageRank for Local Community Detection
Community detection is a classical problem in the field of graph mining. While most algorithms work on the entire graph, it is often interesting in practice to recover only the community containing some given set of seed nodes. In this paper, we propose a novel approach to this problem, using some low-dimensional embedding of the graph based on random walks starting from the seed nodes. From th...
متن کاملDistributing Antidote Using PageRank Vectors
We give an analysis of a variant of the contact process on finite graphs, allowing for non-uniform cure rates, modeling antidote distribution. We examine an inoculation scheme using PageRank vectors which quantify the correlations among vertices in the contact graph. We show that for a contact graph on n nodes we can select a set H of nodes to inoculate such that with probability at least 1−2 ,...
متن کاملAnomaly Detection Using Pagerank Algorithm
— Anomaly detection techniques are widely used in a various type of applications. We explored proximity graphs for anomaly detection and the Page Rank algorithm. We used a different PageRank algorithm at peak in proximity graph collection of data points indicated by vertices, gives results a score quantifying the extent to which each data point is anomalous. In this way we requires first formin...
متن کاملUsing PageRank in Feature Selection
Feature selection is an important task in data mining because it allows to reduce the data dimensionality and eliminates the noisy variables. Traditionally, feature selection has been applied in supervised scenarios rather than in unsupervised ones. Nowadays, the amount of unsupervised data available on the web is huge, thus motivating an increasing interest in feature selection for unsupervise...
متن کاملComputing PageRank using Power Extrapolation
We present a novel technique for speeding up the computation of PageRank, a hyperlink-based estimate of the “importance” of Web pages, based on the ideas presented in [7]. The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing the Web link graph. The algorithm presented here, called Power ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge Based Systems
سال: 2022
ISSN: ['1872-7409', '0950-7051']
DOI: https://doi.org/10.1016/j.knosys.2022.108168